Quantifier-free definable graph operations preserving recognizability
نویسنده
چکیده
We show that an operation on graphs, and more generally, on relational structures that has an inverse definable by a monadic secondorder transduction preserves the family of recognizable sets.
منابع مشابه
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the notion of a recognizable set of graphs in terms of finite congruences. Applications to the construction of efficient algorithms and to the theory of context-free sets of graphs follow naturally. The class of recognizable s...
متن کاملRecognizability, hypergraph operations, and logical types
We study several algebras of graphs and hypergraphs and the corresponding notions of equational sets and recognizable sets. We generalize and unify several existing results which compare the associated equational and recognizable sets. The basic algebra on relational structures is based on disjoint union and quantifier-free definable operations. We expand it to an equivalent one by adding opera...
متن کاملDynamic Complexity under Definable Changes
This paper studies dynamic complexity under definable change operations in the DynFO framework by Patnaik and Immerman. It is shown that for changes definable by parameter-free firstorder formulas, all (uniform) AC1 queries can be maintained by first-order dynamic programs. Furthermore, many maintenance results for single-tuple changes are extended to more powerful change operations: (1) The re...
متن کاملOn the Logical Definability of Certain Graph and Poset Languages
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and to be recognizable in an algebraic framework induced by the notion of modular decomposition of a finite graph. More precisely, we consider the set F∞ of composition operations on graphs which occur in the modular decomp...
متن کاملThe Monadic Second-Order Logic of Graphs V: On Closing the Gap Between Definability and Recognizability
Courcelle, B., The monadic second-order logic of graphs V: on closing the gap between definability and recognizability, Theoretical Computer Science 80 (1991) 153-202. Context-free graph-grammars are considered such that, in every generated graph (3, a derivation tree of G can be constructed by means of monadic second-order formulas that specify its nodes, its labels, the successors of a node e...
متن کامل